Off-Line Real-Time Fault-Tolerant Scheduling
نویسندگان
چکیده
We address the problem of off-line fault tolerant scheduling of an algorithm onto a multiprocessor architecture with distributed memory and provide a generic algorithm which solves this problem. We take into account two kinds of failures: fail-silent and omission. The basic technique we use is the replication of operations and data communications. We then discuss the principles which govern the execution of schedulings with replication under the state-machine and the primary/backup arbitrations between replicas. We also show how to compute the execution date for each operation and the timeouts which are used for detecting failures. We end with a heuristic which, using this calculus, computes a possibly non optimal scheduling by finding plain schedulings for each failure pattern and then combining them into a scheduling with replication.
منابع مشابه
Efficient fault tolerant Scheduling techniques And Backup Overloading techniques For Real Time System
To provide the performance analysis of off-line scheduling algorithms which address the issues of fault tolerance, reliability, real-time, task precedence constraints and heterogeneity in real time systems. The performance measures of these algorithms on which they are differentiated on each other are performance, reliability, schedulability. To compare the performance of backup overloading tec...
متن کاملAnalysis of checkpointing for schedulability of real-time systems
Checkpointing is a relatively cost effective method for achieving fault tolerance in real-time systems. Since checkpointing schemes depend on time redundancy, they could affect the correctness of the system by causing deadlines to be missed. This paper provides exact schedulability tests for fault tolerant task sets under specified failure hypothesis and employing checkpointing to assist in fau...
متن کاملTask Scheduling Algorithms for Fault Tolerance in Real-time Embedded Systems
We survey scheduling algorithms proposed for tolerating permanent and transient failures in real-time embedded systems. These algorithms attempt to provide low-cost solutions to fault tolerance, graceful performance degradation, and load shedding in such systems by exploiting tradeoffs between space and/or time redundancy, timing accuracy, and quality of service. We place fault-tolerant schedul...
متن کاملAnalysis of Selective Fault - Tolerant , Hard Real - Time
An increasing number of applications are demanding real-time performance from their multiprocessor systems. For many of these applications, a failure may produce disastrous results. Such failures are avoided in hard real-time systems by the use of fault-tolerance. In hard real-time multiprocessor scheduling, this fault tolerance may be provided by including several task backups in each schedule...
متن کاملStatic Fault-Tolerant Real-Time Scheduling with "Pseudo-topological" Orders
We give a graph-theoretical model for off-line fault-tolerant scheduling of dataflow algorithms onto multiprocessor architectures with distributed memory. Our framework allows the modeling of both processor and communication channel failures of the “fail silent” type (either transient or permanent), and failure masking is achieved by replicating operations and data communications. We show that,...
متن کامل